A mixed integer programming model for the cyclic job-shop problem with transportation
نویسندگان
چکیده
منابع مشابه
A mixed integer programming model for the cyclic job-shop problem with transportation
This paper focuses on the study of cyclic job-shop problems with transportation and blocking. Within this domain, there are many real world problems like large scale productions, robotic cells, software pipelining or hoist scheduling. The aim in general is to find, for each machine, a feasible order of all the operations processed on this machine, so that an objective function is optimised. In ...
متن کاملComparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints
The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...
متن کاملAn Integer Programming Formulation for the Lot Streaming Problem in a Job Shop Environment with Setups
This paper aims at solving the lot streaming problem in a job shop environment, where setup times are involved. The proposed integer programming formulation sufficiently describes the processing dynamics of individual sublots and enables the simultaneous determination of schedules on machines and sublot sizes. Small instances of job shop problems with consistent sublots can thus be optimally so...
متن کاملA Mixed-Integer Programming Model for Gas Purchase and Transportation
The natural gas supply chain involves three main agents: producers, transportation companies, and local distribution companies (LDCs). We present a MIP model that is the basis for a decision support system developed for a Chilean LDC. This model takes into account many of the complexities of the purchasing and transportation contracts to help optimize daily purchase and transportation decisions...
متن کاملA Mixed Integer Programming Formulation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem
The heterogeneous fixed fleet open vehicle routing problem (HFFOVRP) is one of the most significant extension problems of the open vehicle routing problem (OVRP). The HFFOVRP is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. In this problem, the vehicle doesn’t return to the depot after se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2012
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.04.001